interpolation node造句

This suggests that we look for a set of interpolation nodes with a small Lebesgue constant.
This suggests that we look for a set of interpolation nodes that makes " L " small.
Choosing the points of intersection as interpolation nodes we obtain the interpolating polynomial coinciding with the best approximation polynomial.
For example, if equidistant points are chosen as interpolation nodes, the function from Runge's phenomenon demonstrates divergence of such interpolation.
Thus the remainder term in the Lagrange form of the Taylor theorem is a special case of interpolation error when all interpolation nodes are identical.
It's difficult to find interpolation node in a sentence. 用interpolation node造句挺难的

To illustrate this property, we shall see what happens when " n " = 2 ( i . e . we consider 3 interpolation nodes in which case the property is not trivial ).
The defect of this method, however, is that interpolation nodes should be calculated anew for each new function " f " ( " x " ), but the algorithm is hard to be implemented numerically.
If we assume that we take " 1 and 1 as nodes for interpolation, then as shown by H .-J . Rack ( 1984 and 2013 ), for the case " n " = 3, the explicit values of the optimal ( unique and zero-symmetric ) 4 interpolation nodes and the explicit value of the minimal Lebesgue constant are known.